Typical-case complexity and the SAT competitions
نویسنده
چکیده
The aim of this paper is to gather insight into typical-case complexity of the Boolean Satis ability (SAT) problem by mining the data from the SAT competitions. Speci cally, the statistical properties of the SAT benchmarks and their impact on complexity are investigated, as well as connections between di erent metrics of complexity. While some of the investigated properties and relationships are folklore in the SAT community, this study aims at scienti cally showing what is true from the folklore and what is not.
منابع مشابه
DYNAMIC COMPLEXITY OF A THREE SPECIES COMPETITIVE FOOD CHAIN MODEL WITH INTER AND INTRA SPECIFIC COMPETITIONS
The present article deals with the inter specific competition and intra-specific competition among predator populations of a prey-dependent three component food chain model consisting of two competitive predator sharing one prey species as their food. The behaviour of the system near the biologically feasible equilibria is thoroughly analyzed. Boundedness and dissipativeness of the system are e...
متن کاملUsing Post-Classification Enhancement in Improving the Classification of Land Use/Cover of Arid Region (A Case Study in Pishkouh Watershed, Center of Iran)
Classifying remote sensing imageries to obtain reliable and accurate LandUse/Cover (LUC) information still remains a challenge that depends on many factors suchas complexity of landscape especially in arid region. The aim of this paper is to extractreliable LUC information from Land sat imageries of the Pishkouh watershed of centralarid region, Iran. The classical Maximum Likelihood Classifier ...
متن کاملTricritical points in random combinatorics: the (2+ p)-SAT case
The (2 + p)-satisfiability (SAT) problem interpolates between different classes of complexity theory and is thought to be of basic interest in understanding the onset of typical case complexity in random combinatorics. In this paper, a tricritical point in the phase diagram of the random (2 + p)-SAT problem is analytically computed using the replica approach and found to lie in the range 5 6 p0...
متن کاملA Restriction of Extended Resolution for Clause Learning SAT Solvers
Modern complete SAT solvers almost uniformly implement variations of the clause learning framework introduced by Grasp and Chaff. The success of these solvers has been theoretically explained by showing that the clause learning framework is an implementation of a proof system which is as poweful as resolution. However, exponential lower bounds are known for resolution, which suggests that signi...
متن کاملThe International SAT Solver Competitions
is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014